Reliable broadband communication using a burst erasure correcting code

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scalable Reliable Multicast Using Erasure-Correcting Re-sends

Reliable multicast schemes often cannot scale to large receiver sets due to the problems of state explosion and message implosion. In this paper we propose Erasure Correcting Scalable Reliable Multicast, ECSRM. ECSRM is based on the SRM framework proposed by Floyd et. al., which utilizes NACK suppression to reduce message implosion. ECSRM makes a number of modifications to SRM to addressed enha...

متن کامل

Efficient erasure correcting codes

We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs and analyze the algorithm by analyzing a corresponding discrete-time random process. As a result, we obtain a simple criterion involving the fractions of nodes of different degrees on both sides of the graph which is necessary and sufficient for the decoding process to finish successfully...

متن کامل

A Non-MDS Erasure Code Scheme for Storage Applications

This paper investigates the use of redundancy and self repairing against node failures indistributed storage systems using a novel non-MDS erasure code. In replication method, accessto one replication node is adequate to reconstruct a lost node, while in MDS erasure codedsystems which are optimal in terms of redundancy-reliability tradeoff, a single node failure isrepaired after recovering the ...

متن کامل

A Combined Matrix Ensemble of Low-Density Parity-Check Codes for Correcting a Solid Burst Erasure

A new ensemble of low-density parity-check (LDPC) codes for correcting a solid burst erasure is proposed. This ensemble is an instance of a combined matrix ensemble obtained by concatenating some LDPC matrices. We derive a new bound on the critical minimum span ratio of stopping sets for the proposed code ensemble by modifying the bound for ordinary code ensemble. By calculating this bound, we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGCOMM Computer Communication Review

سال: 1990

ISSN: 0146-4833

DOI: 10.1145/99517.99566